Smaller, faster chemistry

Making Lambda Calculus Smaller, Faster

Some optimizations are speculative: they improve execution speed most but not all of the time, or they trade o faster execution for an increase in code size. Other optimizations, such as dead-variable elimination and algebraic simpli cation, are guaranteed to both reduce code size and speed execution. It makes sense to group all of these \contracting" optimizations together in a single phase of...

Faster and Smaller N-Gram Language Models

N -gram language models are a major resource bottleneck in machine translation. In this paper, we present several language model implementations that are both highly compact and fast to query. Our fastest implementation is as fast as the widely used SRILM while requiring only 25% of the storage. Our most compact representation can store all 4 billion n-grams and associated counts for the Google...

Smaller and Faster Lempel-Ziv Indices

Given a text T [1..u] over an alphabet of size σ = O(polylog(u)) and with k-th order empirical entropy Hk(T ), we propose a new compressed full-text self-index based on the Lempel-Ziv (LZ) compression algorithm, which replaces T with a representation requiring about three times the size of the compressed text, i.e (3+ ǫ)uHk(T )+ o(u log σ) bits, for any ǫ > 0 and k = o(log σ u), and in addition...

Screen idols: faster, smaller, cheaper and smarter.

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants. Our methods involve a new kind of trapdoor, and include specialized algorithms for inverting LWE, randomly sampling SIS preimages, and securely delegating trapdoor...